Lexicographic maximin optimisation for fair bandwidth allocation in computer networks
نویسندگان
چکیده
منابع مشابه
Lexicographic maximin optimisation for fair bandwidth allocation in computer networks
This paper addresses the problem of bandwidth allocation in multi-application computer network environments. Allocations are determined from the solution of a multiple objective optimisation problem under network constraints, where the lexicographic maximin criterion is applied to solve the problem and guarantees fairness and efficiency properties to the solution. An algorithm based on a series...
متن کاملLexicographic Max-Min Optimization for Efficient and Fair Bandwidth Allocation
In many multiple criteria optimization problems preserving fairness among individual outcomes becomes an important issue. This is particularly true for systems that are designed for multiple users or services like computer or telecommunication networks. In this paper we investigate a new approach to the resource allocation preserving the, so called, Max-Min Fairness (MMF) in the solution. We an...
متن کاملGroupwise Maximin Fair Allocation of Indivisible Goods
We study the problem of allocating indivisible goods among n agents in a fair manner. For this problem, maximin share (MMS) is a well-studied solution concept which provides a fairness threshold. Specifically, maximin share is defined as the minimum utility that an agent can guarantee for herself when asked to partition the set of goods into n bundles such that the remaining (n− 1) agents pick ...
متن کاملFair and efficient dynamic bandwidth allocation for multi-application networks
The large diversity of applications and requirements posed to current network environments make the resource allocation problem difficult to work out. This paper proposes a dynamic algorithm based on weighted fair queueing (WFQ) to promote fairness (in the Rawlsian sense) and efficiency (in the Paretian sense) in the allocation of bandwidth for multi-application networks. Utility functions are ...
متن کاملA Distributed Bandwidth Fair Allocation Algorithm for RPR Networks
Despite the rapid development of the resilient packet ring (RPR) technology, the available bandwidth allocation algorithms for RPR networks do not provide satisfactory solutions to meet their performance requirements. To attack this problem, this paper proposes an algorithm, which we call the distributed bandwidth fair allocation (DBFA) algorithm, that achieves the key RPR performance goals, i....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2008
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2006.12.047